Looking-backward probabilities for Gibbs-type exchangeable random partitions
نویسندگان
چکیده
منابع مشابه
Looking-backward probabilities for Gibbs-type exchangeable random partitions
SERGIO BACALLADO, STEFANO FAVARO and LORENZO TRIPPA Department of Statistics, Stanford University, Sequoia Hall, Stanford, CA 94305, USA. E-mail: [email protected] Department of Economics and Statistics, University of Torino, Corso Unione Sovietica 218/bis, 10134 Torino, Italy. E-mail: [email protected] Harvard School of Public Health and Dana-Faber Cancer Institute, 450 Brooklin...
متن کاملPartially Exchangeable Random Partitions
A random partition of the positive integers is called partially exchangeable if for each finite sequence of positive integers n,, ... , nk, the probability that the partition breaks the first n1 + + nk integers into k particular classes, of sizes nl,.. . ., nk in order of their first elements, has the same value p(nl,...,nk) for every possible choice of classes subject to the sizes constraint. ...
متن کاملExchangeable and partially exchangeable random partitions
Call a random partition of the positive integers partially exchangeable if for each finite sequence of positive integers n l , . . . , nk, the probability that the partition breaks the first nl + . . . § nk integers into k particular classes, of sizes nl . . . . , nk in order of their first elements, has the same value p(na . . . . . nk) for every possible choice of classes subject to the sizes...
متن کاملConditional formulae for Gibbstype exchangeable random partitions
Gibbs–type random probability measures and the exchangeable random partitions they induce represent an important framework both from a theoretical and applied point of view. In the present paper, motivated by species sampling problems, we investigate some properties concerning the conditional distribution of the number of blocks with a certain frequency generated by Gibbs–type random partitions...
متن کاملRecord indices and age-ordered frequencies in Exchangeable Gibbs Partitions
We consider a random partition Π of N = {1, 2, . . .} such that, for each n, its restriction Πn to [n] = {1, . . . , n} is given by an exchangeable Gibbs partition with parameters α, V for α ∈ (−∞, 1] and V = (Vn,k) defined recursively by setting V1,1 = 1 and Vn,k = (n− αk)Vn+1,k + Vn+1,k+1 k ≤ n = 1, 2, . . . (Gnedin and Pitman 2006). By ranking the blocks Πn1, . . . , Πnk of Πn by their age-o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2015
ISSN: 1350-7265
DOI: 10.3150/13-bej559